Improved speech recognition using iterative decoding based on confidence measures

نویسندگان

  • Jun Ogata
  • Yasuo Ariki
چکیده

In this paper, a decoding method incorporating word-level conndence measures for improved speech recognition is presented. At rst, we focus on the estimation of conndence measures from the word graph and evaluate them in word graph rescoring (2nd-pass in 2-pass search system). Next, we propose the lexical tree search (1st-pass in 2-pass search system) incorporating the word-level conndence measures and an iterative decoding based on the conndence measures, resulting in the reconstruction of the word graph. The experimental results showed that this method achieved a slight i m p r o vement a t w ord accuracy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic speech recognition using acoustic confidence conditioned language models

A modi ed decoding algorithm for automatic speech recognition (ASR) will be described which facilitates a closer coupling between the acoustic and language modeling components of a speech recognition system. This closer coupling is obtained by extracting word level measures of acoustic con dence during decoding, and making coded representations of these con dence measures available to the ASR n...

متن کامل

VAD-measure-embedded decoder with online model adaptation

We previously proposed a decoding method for automatic speech recognition utilizing hypothesis scores weighted by voice activity detection (VAD)-measures. This method uses two Gaussian mixture models (GMMs) to obtain confidence measures: one for speech, the other for non-speech. To achieve good search performance, we need to adapt the GMMs properly for input utterances and environmental noise. ...

متن کامل

Local word confidence measure using word graph and n-best list

This paper presents some confidence measures for large vocabulary speech recognition which are based on word graph or N-Best List structures. More and more applications need fast estimation of any measures in order to stay real-time. We propose some simple and fast measures, locally computed, that can be directly used within the first decoding recognition process. We also define some other meas...

متن کامل

Verification of Speech Recognition Results Incorporating In-domain Confidence and Discourse Coherence Measures

Conventional confidence measures for assessing the reliability of ASR (automatic speech recognition) output are typically derived from “low-level” information which is obtained during speech recognition decoding. In contrast to these approaches, we propose a novel utterance verification framework which incorporates “high-level” knowledge sources. Specifically, we investigate two measures: in-do...

متن کامل

Automatic estimation of decoding parameters using large-margin iterative linear programming

The decoding parameters in automatic speech recognition — grammar factor and word insertion penalty — are usually determined by performing a grid search on a development set. Recently, we cast their estimation as a convex optimization problem, and proposed a solution using an iterative linear programming algorithm. However, the solution depends on how well the development data set matches with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001